Straight-line programs in geometric elimination theory
نویسندگان
چکیده
منابع مشابه
Straight{line Programs in Geometric Elimination Theory
We present a new method for solving symbolically zero–dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures : arithmetic networks and straight–line programs. For sequential time complexity measured by network size we obtain the following result : it is possible to solve any affine or toric zero–dimensio...
متن کاملIndexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملStraight-line Programs in Polynomial Equation Solving
Solving symbolically polynomial equation systems when intermediate and final polynomials are represented in the usual dense encoding turns out to be very inefficient: the sizes of the systems one can deal with do not respond to realistic needs. Evaluation representations appeared in this frame a decade ago as a new possibility to treat new families of problems. We present a survey of the most r...
متن کاملFaster Sparse Interpolation of Straight-Line Programs
We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at most half the number of terms of f , then recurses on the difference f−f. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more ef...
متن کاملUnary Pushdown Automata and Straight-Line Programs
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1998
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(96)00099-0